COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Recursive programming and proving, Computer Science 206
C00004 ENDMK
C⊗;
Recursive programming and proving, Computer Science 206
John McCarthy,Margaret Jacks 356, 7-4430, 40
lecture, 3 units,

CS206. Recursive Programming and Proving - Recursive programming using
the LISP language and techniques for proving the corrrectness of
recursive programs.  Computing with symbolic expressions
rather than numbers, e.g. algebraic expressions, logical expressions,
patterns, graphs, and computer programs.
Pattern matching and syntax directed computation.  Preparation for
work in artificial intelligence is emphasized.

Prerequisite: 107 or equivalent ability to program.
Some knowledge of the notation of first order logic is helpful.

II. This is primarily a lecture course with occasional in-class
practice in instant programming.

Text: McCarthy and Talcott, LISP: Programming and Proving (preliminary
1980  edition)

Final, 3 hours of problems

One or two midterms.

There are problem sets and a term project.

pass/no credit is offered.

Additional units may be negotiated for especially ambitious term projects.